منابع مشابه
Isomorphisms and traversability of directed path graphs
The concept of a line digraph is generalized to that of a directed path graph. The directed path graph → Pk(D) of a digraph D is obtained by representing the directed paths on k vertices of D by vertices. Two vertices are joined by an arc whenever the corresponding directed paths in D form a directed path on k + 1 vertices or form a directed cycle on k vertices in D. In this introductory paper ...
متن کاملPath Transferability of Planar Graphs
We regard a path as a train moving on a graph. A graph G is called n-transferable if any path of length n can be moved to any other such path by several steps. We will show that every planar graph with minimum degree at least three is at most 10 transferable.
متن کاملOn k-path Hamiltonian planar graphs
We give a simple upper bound on k for k-path-hamiltonianness of a graph. Also given are exact values for maximal planar graphs. UN/VERSJTY LIBRARIES CARNEGIE-MELLON UNIVERSITY PITTSBURGH, PENNSYLVANIA 15213
متن کاملOn the Path-Width of Planar Graphs
In this paper, we present a result concerning the relation between the path-with of a planar graph and the path-width of its dual. More precisely, we prove that for a 3-connected planar graph G, pw(G) ≤ 3pw(G∗) + 2. For 4-connected planar graphs, and more generally for Hamiltonian planar graphs, we prove a stronger bound pw(G∗) ≤ 2 pw(G) + c. The best previously known bound was obtained by Fomi...
متن کاملOn the Path Separability of Planar Graphs
It is known that every weighted planar graph with n vertices contains three shortest paths whose removal halves the graph into connected components of at most n/2 vertices. Whether this property remains true with the use of two shortest paths only is an open problem. We show that two shortest paths are enough for a large family of planar graphs, called face-separable, composed of graphs for whi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1974
ISSN: 0012-365X
DOI: 10.1016/0012-365x(74)90040-5